Hidden Number Problem Given Bound of Secret
نویسندگان
چکیده
منابع مشابه
The Multivariate Hidden Number Problem
This work extends the line of research on the hidden number problem. Motivated by studying bit security in finite fields, we define the multivariate hidden number problem. Here, the secret and the multiplier are vectors, and partial information about their dot product is given. Using tools from discrete Fourier analysis introduced by Akavia, Goldwasser and Safra, we show that if one can find th...
متن کاملOn the Number of Markoff Numbers Below a Given Bound
According to a famous theorem of Markoff, the indefinite quadratic forms with exceptionally large minima (greater than f of the square root of the discriminant) are in 1 : 1 correspondence with the solutions of the Diophantine equation p2 + q2 + r1 = ~ipqr. By relating Markoffs algorithm for finding solutions of this equation to a problem of counting lattice points in triangles, it is shown tha...
متن کاملOn the modular inversion hidden number problem
We give a rigorous deterministic polynomial time algorithm for the modular inversion hidden number problem introduced by D. Boneh, S. Halevi and N. A. Howgrave-Graham in 2001. For our algorithm we need to be given about 2/3 of the bits of the output, which matches one of the heuristic algorithms of D. Boneh, S. Halevi and N. A. Howgrave-Graham and answers one of their open questions. However th...
متن کاملA hidden number problem in small subgroups
Boneh and Venkatesan have proposed a polynomial time algorithm for recovering a hidden element α ∈ Fp, where p is prime, from rather short strings of the most significant bits of the residue of αt modulo p for several randomly chosen t ∈ Fp. González Vasco and the first author have recently extended this result to subgroups of Fp of order at least p 1/3+ε for all p and to subgroups of order at ...
متن کاملHidden Number Problem in Small Subgroups
Boneh and Venkatesan have proposed a polynomial time algorithm for recovering a ”hidden” element α ∈ IFp, where p is prime, from rather short strings of the most significant bits of the residue of αt modulo p for several randomly chosen t ∈ IFp. González Vasco and the first author have recently extended this result to subgroups of IFp of order at least p 1/3+ε for all p and to subgroups of orde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Computer Science and Engineering
سال: 2017
ISSN: 2475-8841
DOI: 10.12783/dtcse/aita2017/16007